Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
b(c(x1)) → a(x1)
b(b(x1)) → a(c(x1))
a(x1) → c(b(x1))
c(c(c(x1))) → b(x1)
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
b(c(x1)) → a(x1)
b(b(x1)) → a(c(x1))
a(x1) → c(b(x1))
c(c(c(x1))) → b(x1)
Q is empty.
We use [27] with the following order to prove termination.
Knuth-Bendix order [24] with precedence:
b1 > a1 > c1
and weight map:
c_1=2
b_1=5
a_1=7
dummyConstant=1